Adaptive regularization in compressed sensing using the discrepancy principle

نویسندگان

  • K. F. King
  • L. Marinelli
  • C. J. Hardy
چکیده

coil and the Fourier operator, Ψ is a transform that produces a compressible function when operating on the image m, and the constant λ is adjusted to balance data fidelity and artifact reduction (first and second terms in J). If λ is chosen too small, uncorrected aliasing remains in the image. If λ is chosen too large, the image appears blurry. Many methods have been developed to automatically determine the optimal λ (3). Most are problematic for MRI data because either the assumptions are inapplicable or the computational burden is too high. Here we focus on a simple method called the discrepancy principle that chooses λ based on the size of the first term in J, also called the discrepancy term. A version of this method has been used for GRAPPA regularization (4). Methods

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Motion-Adaptive Spatio-Temporal Regularization (MASTeR) for Accelerated Dynamic MRI

Accelerated MRI techniques reduce signal acquisition time by undersampling k-space. A fundamental problem in accelerated MRI is the recovery of quality images from undersampled k-space data. Current state-of-the-art recovery algorithms exploit the spatial and temporal structures in underlying images to improve the reconstruction quality. In recent years, compressed sensing theory has helped for...

متن کامل

The discretized discrepancy principle under general source conditions

We discuss adaptive strategies for choosing regularization parameters in TikhonovPhillips regularization of discretized linear operator equations. Two rules turn out to be entirely based on the underlying regularization scheme. Among them only the discrepancy principle allows to search for the optimal regularization parameter from the easiest problem. This possible advantage cannot be used with...

متن کامل

Image Reconstruction in Compressed Remote Sensing with Low-rank and L1-norm Regularization

In this paper, we proposed a new model with nuclear-norm and L1-norm regularization for image reconstruction in aerospace remote sensing. The curvelet based L1-norm regularization promotes sparse reconstruction, while the low-rank based nuclear-norm regularization leads to a principle component solution. Split Bregman method is used to solve this problem. Numerical experiments show the proposed...

متن کامل

Frames for compressed sensing using coherence

We give some new results on sparse signal recovery in the presence of noise, for weighted spaces. Traditionally, were used dictionaries that have the norm equal to 1, but, for random dictionaries this condition is rarely satised. Moreover, we give better estimations then the ones given recently by Cai, Wang and Xu.

متن کامل

Adaptive multi-penalty regularization based on a generalized Lasso path

For many algorithms, parameter tuning remains a challenging and critical task, which becomes tedious and infeasible in a multi-parameter setting. Multi-penalty regularization, successfully used for solving undetermined sparse regression of problems of unmixing type where signal and noise are additively mixed, is one of such examples. In this paper, we propose a novel algorithmic framework for a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008